On the decidability of bounded valuedness of transducers (Preliminary draft)
نویسندگان
چکیده
We give new, conceptually different, and hopefully more easily understandable proofs for two results on transducers: the decidability of k-valuedness (Gurari-Ibarra’s theorem) and the decidability of bounded valuedness (Weber’s theorem). Our constructions yield algorithms that closely depend on the structure of the transducers, and better complexity bounds.
منابع مشابه
On the Decidability of Bounded Valuedness for Transducers
We give a new and conceptually different proof for the decidability of k-valuedness of transducers (a result due to Gurari and Ibarra), without resorting to any other kind of machines than transducers. In contrast with the previous proof, our algorithm takes into account the structure of the analysed transducers and yields better complexity bounds. With the same techniques, we also present a ne...
متن کاملSixth Workshop on Non - Classical Models of Automata and Applications ( NCMA 2014 ) Short Papers
We generalize the models of visibly pushdown automata (VPDAs) and visibly pushdown transducers (VPDTs) by equipping them with reversal-bounded counters. We show that some of the results for VPDAs and VPDTs (e.g., closure under intersection and decidability of emptiness for VPDA languages) carry over to the generalized models, but other results (e.g., determinization and closure under complement...
متن کاملAmbiguity, Valuedness and Costs
This survey reports results on the ambiguity of nite tree automata, the valuedness of bottom{up nite state tree transducers and boundedness of cost automata. 0 Introduction Ambiguity, valuedness and maximal cost are diierent measures on the behaviour of nite state devices. The ambiguity of an automaton is the least upper bound on the number of diierent accepting computations for a given input. ...
متن کاملOn the decomposition of k-valued rational relations (Preliminary draft)
We give a new and hopefully more easily understandable structural proof for the decomposition of a k-valued transducer into k unambiguous functional transducers, a result established by A. Weber. The number of states of the transducers given by our construction outperforms Weber’s one by one exponential. Moreover, we solve a problem left open by Weber, the decomposition of a bounded length-degr...
متن کاملOn the Decomposition of Finite-Valued Streaming String Transducers
We prove the following decomposition theorem: every 1-register streaming string transducer that associates a uniformly bounded number of outputs with each input can be effectively decomposed as a finite union of functional 1-register streaming string transducers. This theorem relies on a combinatorial result by Kortelainen concerning word equations with iterated factors. Our result implies the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007